Designing Dynamic Two-Level Branch Predictors Based on Pattern Locality
نویسندگان
چکیده
To design a good two-level predictor, we found that a low interference among branches and an even utilization of the entries in the pattern table are two key factors. In order to arrive at a balanced design and achieve the above two goals simultaneously, we rst introduce the concept of branch pattern locality. Then, a new predictor design, called the Global PAttern Locality predictor (G-PAL), is introduced. The predictor is developed based on pattern locality and employs a cache-like pattern table to keep only those patterns that are referenced most frequently and recently. In this way, not only the interference among branches can be reduced, but the entries in the pattern table can be fully utilized.
منابع مشابه
Effective Branch Prediction through Caching of Aliasing Branches
High performance CPUs constantly face obstacles in pipelining delays from conditional branches to reach their expected potential. Precise branch prediction is required to overcome this performance limitation imposed on high performance architecture and is the key to many techniques for enhancing and exploiting Instruction-Level Parallelism (ILP). In general, prediction accuracy can be improved ...
متن کاملImproving Value Prediction by Exploiting Both Operand and Output Value Locality
Existing value reuse and prediction schemes use a hardware prediction table or reuse buffer to store an instruction’s value history based on its program. The result cache [17], on the other hand, has been proposed to exploit operand value locality by reusing the output values produced by any instruction of the same type that has been executed previously using the same input operands. However, d...
متن کاملDynamic feature selection for hardware prediction
It is often possible to greatly improve the performance of a hardware system via the use of predictive (speculative) techniques. For example, the performance of out-of-order microprocessors is greatly enhanced by predicting the outcomes of conditional branch instructions. Most hardware predictors are table based (e.g., two-level branch predictors)-maintaining predictive information for each com...
متن کاملA Shadow Dynamic Finite State Machine for Branch Prediction: An Alternative for the 2-bit Saturating Counter
In order to meet high performance demands, modern processor architectures exploit varieties of dynamic branch prediction topologies ([4]-[6] provide an excellent introduction and research coverage) to increase instruction-level parallelism (ILP). Dynamic branch predictors use run-time branch execution history to predict branch direction. Most previous techniques use a branch pattern history tab...
متن کاملThe Schemes and Performances of Dynamic Branch predictors
The techniques of Instruction Level Parallelism (ILP) and pipeline have been used well to speed up the execution of instructions. The conditional branches are the critical factor to the effectiveness of a deep pipeline since the branch instructions can always break the flow of instructions through the pipeline and result in high execution cost. In order to achieve better CPU performance, many s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996